Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
x * (y * z) |
→ (x * y) * z |
| 2: |
|
x * x |
→ x |
|
There are 2 dependency pairs:
|
| 3: |
|
x *# (y * z) |
→ (x * y) *# z |
| 4: |
|
x *# (y * z) |
→ x *# y |
|
Consider the SCC {3,4}.
The constraints could not be solved.
Tyrolean Termination Tool (0.00 seconds)
--- May 3, 2006